A Pac-Man bot based on grammatical evolution
نویسندگان
چکیده
In this article, we propose the development of a bot for playing the video game Ms. Pac-Man vs. Ghosts using a grammatical evolution based evolutionary algorithm. This technique evolves programs that are evaluated by executing them in the game. The program encodes the strategy that the bot plays and is obtained through the derivation of grammar rules in a particular order, which is defined by the algorithm. We experimented with two different grammars: The first one includes high-level actions and the second one involves medium-level actions. Both grammars include state providers. To make the evolutionary process more efficient, we perform a series of optimizations on the evolutionary algorithm, including parallelization of the fitness evaluation and multi-objective optimization. Experimental results using the two grammars and two different ghost controllers are presented. We report better results with our bots than the baseline controllers and other controllers based on grammatical evolution.
منابع مشابه
Evolving a Ms. PacMan Controller Using Grammatical Evolution
In this paper we propose an evolutionary approach capable of successfully combining rules to play the popular video game, Ms. PacMan. In particular we focus our attention on the benefits of using Grammatical Evolution to combine rules in the form of “if then perform ”. We defined a set of high-level functions that we think are necessary to successufully maneuver Ms. Pac-Man ...
متن کاملPac-Man or Pac-Bot? Exploring subjective perception of players' humanity in Ms. Pac-Man
Simulating human behaviour when playing video games has been recently proposed as an interesting challenge for the research community on Artificial Intelligence. In the exploration on Machine Learning techniques for training virtual players (i.e. computer bots) to imitate the conduct of real (human) players, we are using the classic arcade game Ms. Pac-Man as testbed. Our research goal is to fi...
متن کاملClever Pac-man
In this paper we show how combining fuzzy sets and reinforcement learning a winning agent can be created for the popular Pac-man game. Key elements are the classification of the state into a few fuzzy classes that makes the problem manageable. Pac-man policy is defined in terms of fuzzy actions that are defuzzified to produce the actual Pac-man move. A few heuristics allow making the Pac-man st...
متن کاملDiscovering Multimodal Behavior in Ms. Pac-Man Through Evolution of Modular Neural Networks
Ms. Pac-Man is a challenging video game in which multiple modes of behavior are required: Ms. Pac-Man must escape ghosts when they are threats and catch them when they are edible, in addition to eating all pills in each level. Past approaches to learning behavior in Ms. Pac-Man have treated the game as a single task to be learned using monolithic policy representations. In contrast, this paper ...
متن کاملEnhancements for Monte-Carlo Tree Search in Ms Pac-Man
In this paper enhancements for the Monte-Carlo Tree Search (MCTS) framework are investigated to play Ms Pac-Man. MCTS is used to find an optimal path for an agent at each turn, determining the move to make based on randomised simulations. Ms Pac-Man is a real-time arcade game, in which the protagonist has several independent goals but no conclusive terminal state. Unlike games such as Chess or ...
متن کامل